Supervised Coloring of Volumes

نویسندگان

  • Vivek Srivastava
  • Sarang Lakare
  • Arie Kaufman
چکیده

We present a novel approach for assigning realistic colors to a scalar volume. Color assignment is typically done using a transfer function. However, the linear mapping between the scalar value and color produces unrealistic-looking results. In our approach, we use a reference multichannel scalar volume and its corresponding color volume to build the mapping. Using the Visible Human Male (VHM) dataset as the reference volume, we employ various machine learning techniques to find the best mapping between the VHM multichannel scalar data and the color data. We generate a feature vector for each voxel in the VHM dataset based on its 3D neighborhood. The feature vectors and their associated colors are then used to train the learning machine. After training, feature vectors from the scalar volume to be colored are fed into the learning machine to find the color. We have performed experiments on the VHM and Visible Human Female (VHF), foot and head datasets. The resultant color volumes correspond well with the full-color cross-sections of the original VH dataset.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Inference as Vertex Coloring

This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA consistent with the data (regular inference). We solve this problem by translating it in its entirety to a vertex coloring problem. Essentially, such a problem consists of two types of constrain...

متن کامل

Hybrid Optimizations: Which Optimization Algorithm to Use?

We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of different algorithms that implement the same optimization. They use a heuristic to predict the most appropriate algorithm for each piece of code being optimized. Specifically, we construct a hybrid register allocator t...

متن کامل

A practical algorithm for [r, s, t]-coloring of graph

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...

متن کامل

Reduction of 4-methylimidazole in caramel coloring by ɣ-irradiation

4-Methylimidazole (4-MEI) is a simple nitrogen-containing heterocyclic compound, and recently classified as group 2B by International Agency for Research on Cancer (IARC). Caramel coloring is widely applied food coloring in many food products including coffee, carbonated beverages, beer and wine. In present study, ɣ-irradiation was applied to Caramel Color III to reduce the level of 4-MEI witho...

متن کامل

Coloring of the Self - Organising Maps based on class labels

The Self-Organizing Map (SOM) is a useful and strong tool for data analysis, especially for large data sets or data sets of high dimensionality. SOM visualizations map the data model dimensions to visual dimensions like color and position, thus they help exploring the SOM. Visualization can also involve the data itself so that it helps accessing information that are not available in the trained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003